Randić index, irregularity and complex biomolecular networks.

نویسنده

  • Ernesto Estrada
چکیده

A new formulation of Randić index is carried out as a minimization of a quadratic form which involves the Laplacian matrix of a graph. Using this formulation it is easy to realize that Randić index is useful in defining a new index of irregularity, which is then formulated here. A new context for the study of irregularity of graphs is advanced as a necessity for studying complex (biological) networks. We analyze both Randić and irregularity indices for random networks with Poisson and power-law degree distributions. Then, we analyze the irregularity of 10 protein-protein interaction networks in different organisms ranging from 50 to 3000 nodes. Finally, some šruminations' about the elegance and applicability of Randić index are remarked.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms and complexity results for finding graphs with extremal Randić index

We show that finding a subgraph realization with the minimum generalized Randić index for a given base graph and degree sequence is solvable in polynomial time by formulating the problem as the minimum weight perfect b-matching problem of Edmonds (J Res Natl Bur Stand 69B (1965), 125–130). However, the realization found via this reduction is not guaranteed to be connected. Approximating the min...

متن کامل

Algorithm and Complexity for a Network Assortativity Measure

We show that finding a graph realization with the minimum Randić index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect b-matching problem. However, the realization found via this reduction is not guaranteed to be connected. Approximating the minimum weight b-matching problem subject to a connectivity constraint is shown to be NP-...

متن کامل

A Survey on the Randić Index

The general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real number, which is called the Randić index or connectivity index (or branching index) for α = −1/2 proposed by Milan Randić in 1975. The paper outlines the results known for the (general) Randić inde...

متن کامل

On the Higher Randić Index

Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

متن کامل

Structural Relationship Between Randić Indices, Adjacency, Distance Matrixes and Molar Absorption Coefficient of Linear Conjugated Polyene Compounds

One of the useful indices in molecular topology is Randić index. The alternative double bonds andconjugation in the polyene compounds are one of the main properties in these compounds. Someof the molecular orbital and structural properties refer to this specialty, such as: molar absorptioncoefficient (εmax) , electrical conductivity and difference energy level of the HOMO and LUMOorbitals, etc....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta chimica Slovenica

دوره 57 3  شماره 

صفحات  -

تاریخ انتشار 2010